Efficient Node Overlap Removal Using a Proximity Stress Model
نویسندگان
چکیده
Abstract. When drawing graphs whose nodes contain text or graphics, the non-trivial node sizes must be taken into account, either as part of the initial layout or as a post-processing step. The core problem is to avoid overlaps while retaining the structural information inherent in a layout using little additional area. This paper presents a new node overlap removal algorithm that does well by these measures.
منابع مشابه
Efficient, Proximity-Preserving Node Overlap Removal
When drawing graphs whose nodes contain text or graphics, the nontrivial node sizes must be taken into account, either as part of the initial layout or as a post-processing step. The core problem in avoiding or removing overlaps is to retain the structural information inherent in a layout while minimizing the additional area required. This paper presents a new node overlap removal algorithm tha...
متن کاملA New Similarity Measure Based on Item Proximity and Closeness for Collaborative Filtering Recommendation
Recommender systems utilize information retrieval and machine learning techniques for filtering information and can predict whether a user would like an unseen item. User similarity measurement plays an important role in collaborative filtering based recommender systems. In order to improve accuracy of traditional user based collaborative filtering techniques under new user cold-start problem a...
متن کاملEfficient collection of sensor data via a new accelerated random walk
Motivated by the problem of efficiently collecting data from wireless sensor networks via a mobile sink, we present an accelerated random walk on Random Geometric Graphs. Random walks in wireless sensor networks can serve as fully local, lightweight strategies for sink motion that significantly reduce energy dissipation but introduce higher latency in the data collection process. In most cases ...
متن کاملFacile and Efficient Self-template Synthesis of Core-coronal-shell ZnO@ZIF-8 Nanohybrid Using Ascorbic Acid and its Application for Arsenic Removal
In the present contribution, a facile and efficient protocol for synthesis a nanohybrid structure of core-coronal-shell ZnO@ZIF-8 using ascorbic acid (ZnO@AA/ZIF-8) as a new adsorbent for arsenic removal from water has been represented. For this purpose, the ZnO nanospheres were synthesized by a green and simple method followed by coating with ascorbic acid (AA) to modify their surface to achie...
متن کاملNode Overlap Removal by Growing a Tree
Abstract. Node overlap removal is a necessary step in many scenarios including laying out a graph, or visualizing a tag cloud. Our contribution is a new overlap removal algorithm that iteratively builds a Minimum Spanning Tree on a Delaunay triangulation of the node centers and removes the node overlaps by ”growing” the tree. The algorithm is simple to implement yet produces high quality layout...
متن کامل